The Matroid Cup Game

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Chip Firing Game and Matroid Complexes

In this paper we construct from a cographic matroid M , a pure multicomplex whose degree sequence is the h–vector of the the matroid complex of M. This result proves a conjecture of Richard Stanley [Sta96] in the particular case of cographic matroids. We also prove that the multicomplexes constructed are M–shellable, so proving a conjecture of Manoj Chari [Cha97] again in the case of cographic ...

متن کامل

The Catalan matroid

We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the “Catalan matroid” Cn. We describe this matroid in detail; among several other results, we show that Cn is self-dual, it is representable over Q but not over finite fields Fq with q ≤ n− 2, and it has a nice Tutte polynomial. We then generalize our construction to obtain a family of matroids, whic...

متن کامل

The Lazy Matroid Problem

This article introduces the lazy matroid problem, which captures the goal of saving time or money in certain task selection scenarios. We are given a budget B and a matroid M with weights on its elements. The problem consists in finding an independent set F of minimum weight. In addition, F is feasible if its augmentation with any new element x implies that either F + x exceeds B or F + x is de...

متن کامل

The Quiz World Cup: A Game-Based Distance Learning Method for Teaching Cognitive Subject Matter Content

Teaching cognitive subject matter via distance learning often suffers from different aspects, such as providing passive content or missing motivational elements. Therefore, this paper deals with the extension of an online course on theoretical topics by game-based elements and proposes a distance learning method called “Quiz World Cup”. After highlighting problematic aspects of teaching cogniti...

متن کامل

Covering matroid

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions, coverings are more natural combinatorial objects and can sometimes be more efficient to deal with problems in the real world. Through extending partitions to cover...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Letters

سال: 2021

ISSN: 0167-6377

DOI: 10.1016/j.orl.2021.04.005